Alphasort: A cache-sensitive parallel external sort
نویسندگان
چکیده
منابع مشابه
Merge Path – Cache-Efficient Parallel Merge and Sort
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Due to the extremely low compute to memoryaccess ratio, it is also critically important to efficiently utilize ...
متن کاملParallel External Sort of Floating-Point Data by Integer Conversion
This paper introduces a fast external sorting algorithm of floating point numbers with integer operations only, which shortens the computing time significantly. Conversion overhead to integer can be avoided if the floating point data are stored in the disk since integer conversion is made while they are read from the data file. Experimentally large-scale data stored in the disk are sorted in a ...
متن کاملDEMSort — Distributed External Memory Sort
We present the results of our DEMSort program in various categories of the SortBenchmark. DEMSort is a sophisticated and highly tuned implementation of a mergesort-based algorithm. It makes use of several libraries to support at the same time distributed-memory parallelism and shared-memory parallelism, in addition to very efficient disk I/O. This makes it excellent for sorting huge volumes of ...
متن کاملParallel String Sample Sort
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we propose string sample sort. The algorithm makes effective use of the memory hierarchy, uses additional word level parallelism, and largely avoids branch mispredi...
متن کاملPartitioned Parallel Radix Sort
Load balanced parallel radix sort solved the load imbalance problem present in parallel radix sort. By redistributing the keys in each round of radix, each processor has exactly the same number of keys, thereby reducing the overall sorting time. Load balanced radix sort is currently known as the fastest internal sorting method for distributed-memory multiprocessors. However, as the computation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 1995
ISSN: 1066-8888,0949-877X
DOI: 10.1007/bf01354877